Discrete Temporal Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
A Discrete Temporal Constraint Satisfaction Problems
5 Definability of Successor and Order 10 5.1 Degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.2 Compactness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5.3 Finite-range Endomorphisms . . . . . . . . . . . . . . . . . . . . . . . . . 15 5.4 Petrus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 ...
متن کاملContext in Discrete Constraint Satisfaction Problems
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications modeled as CSPs, it is important to be able to build on the spot equivalence classes of objects of the world to allow local modifications of the solutions and highlight opportunities for change. The concept of interchangeability, defined by Freuder [4], formalizes equi...
متن کاملPartial Constraint Satisfaction of Disjunctive Temporal Problems
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy a maximal number of constraints. While partial constraint satisfaction (PCS) has been commonly applied to finite-domain CSPs, its application in this setting is of particular interest, as temporal problems are tradition...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2018
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3154832